0.09/0.14 % Problem : Vampire---4.8_18312 : TPTP v0.0.0. Released v0.0.0. 0.09/0.14 % Command : run_E %s %d THM 0.13/0.34 % Computer : n015.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1440 0.13/0.34 % WCLimit : 180 0.13/0.34 % DateTime : Mon Jul 3 13:11:40 EDT 2023 0.13/0.35 % CPUTime : 0.19/0.49 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312 0.19/0.49 # Version: 3.1pre001-ho 0.19/0.58 # Preprocessing class: HSLMSMSSLLLCHSA. 0.19/0.58 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.19/0.58 # Starting lpo1_fix with 540s (3) cores 0.19/0.58 # Starting full_lambda_9 with 180s (1) cores 0.19/0.58 # Starting almost_fo_4 with 180s (1) cores 0.19/0.58 # Starting new_ho_9 with 180s (1) cores 0.19/0.58 # Starting pre_casc_4 with 180s (1) cores 0.19/0.58 # Starting ho_unfolding_6 with 180s (1) cores 0.19/0.58 # full_lambda_9 with pid 18491 completed with status 0 0.19/0.58 # Result found by full_lambda_9 0.19/0.58 # Preprocessing class: HSLMSMSSLLLCHSA. 0.19/0.58 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.19/0.58 # Starting lpo1_fix with 540s (3) cores 0.19/0.58 # Starting full_lambda_9 with 180s (1) cores 0.19/0.58 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 0.19/0.58 # Search class: HGHSM-FSLM32-DHSMMSBN 0.19/0.58 # partial match(1): HGHSM-FSLM32-MHSMMSBN 0.19/0.58 # Scheduled 12 strats onto 1 cores with 180 seconds (180 total) 0.19/0.58 # Starting full_lambda_5 with 15s (1) cores 0.19/0.58 # full_lambda_5 with pid 18496 completed with status 0 0.19/0.58 # Result found by full_lambda_5 0.19/0.58 # Preprocessing class: HSLMSMSSLLLCHSA. 0.19/0.58 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.19/0.58 # Starting lpo1_fix with 540s (3) cores 0.19/0.58 # Starting full_lambda_9 with 180s (1) cores 0.19/0.58 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 0.19/0.58 # Search class: HGHSM-FSLM32-DHSMMSBN 0.19/0.58 # partial match(1): HGHSM-FSLM32-MHSMMSBN 0.19/0.58 # Scheduled 12 strats onto 1 cores with 180 seconds (180 total) 0.19/0.58 # Starting full_lambda_5 with 15s (1) cores 0.19/0.58 # Preprocessing time : 0.005 s 0.19/0.58 # Presaturation interreduction done 0.19/0.58 0.19/0.58 # Proof found! 0.19/0.58 # SZS status Theorem 0.19/0.58 # SZS output start CNFRefutation 0.19/0.58 thf(decl_22, type, is_of: $i > ($i > $o) > $o). 0.19/0.58 thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o). 0.19/0.58 thf(decl_25, type, in: $i > $i > $o). 0.19/0.58 thf(decl_61, type, imp: $o > $o > $o). 0.19/0.58 thf(decl_62, type, d_not: $o > $o). 0.19/0.58 thf(decl_67, type, l_or: $o > $o > $o). 0.19/0.58 thf(decl_72, type, l_some: $i > ($i > $o) > $o). 0.19/0.58 thf(decl_77, type, e_is: $i > $i > $i > $o). 0.19/0.58 thf(decl_123, type, nat: $i). 0.19/0.58 thf(decl_124, type, n_is: $i > $i > $o). 0.19/0.58 thf(decl_127, type, n_some: ($i > $o) > $o). 0.19/0.58 thf(decl_142, type, n_pl: $i > $i > $i). 0.19/0.58 thf(decl_147, type, diffprop: $i > $i > $i > $o). 0.19/0.58 thf(decl_148, type, d_29_ii: $i > $i > $o). 0.19/0.58 thf(decl_149, type, iii: $i > $i > $o). 0.19/0.58 thf(decl_151, type, moreis: $i > $i > $o). 0.19/0.58 thf(decl_155, type, esk1_0: $i). 0.19/0.58 thf(decl_156, type, esk2_0: $i). 0.19/0.58 thf(decl_157, type, esk3_0: $i). 0.19/0.58 thf(decl_158, type, esk4_0: $i). 0.19/0.58 thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', def_d_not)). 0.19/0.58 thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', def_imp)). 0.19/0.58 thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', def_d_29_ii)). 0.19/0.58 thf(def_l_or, axiom, ((l_or)=(^[X42:$o]:(imp @ ((d_not @ ((X42))))))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', def_l_or)). 0.19/0.58 thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', def_e_is)). 0.19/0.58 thf(def_moreis, axiom, ((moreis)=(^[X1:$i, X187:$i]:((l_or @ ((d_29_ii @ X1 @ X187)) @ ((n_is @ X1 @ X187)))))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', def_moreis)). 0.19/0.58 thf(def_n_some, axiom, ((n_some)=(l_some @ nat)), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', def_n_some)). 0.19/0.58 thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', def_n_is)). 0.19/0.58 thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', def_all_of)). 0.19/0.58 thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', def_is_of)). 0.19/0.58 thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', def_iii)). 0.19/0.58 thf(satz22a, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X271:$i]:((in @ X271 @ nat))) @ (^[X272:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:((all_of @ (^[X10:$i]:((in @ X10 @ nat))) @ (^[X10:$i]:(((moreis @ X1 @ X272)=>((d_29_ii @ (n_pl @ X1 @ X4) @ (n_pl @ X272 @ X10))<=(d_29_ii @ X4 @ X10))))))))))))))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', satz22a)). 0.19/0.58 thf(satz21a, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X189:$i]:((in @ X189 @ nat))) @ (^[X190:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:((all_of @ (^[X10:$i]:((in @ X10 @ nat))) @ (^[X10:$i]:(((iii @ X1 @ X190)=>((iii @ (n_pl @ X1 @ X4) @ (n_pl @ X190 @ X10))<=(iii @ X4 @ X10))))))))))))))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', satz21a)). 0.19/0.58 thf(satz19f, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X215:$i]:((in @ X215 @ nat))) @ (^[X216:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((iii @ (n_pl @ X4 @ X1) @ (n_pl @ X4 @ X216))<=(iii @ X1 @ X216))))))))))), file('/export/starexec/sandbox/tmp/tmp.wm9jSVn1cD/Vampire---4.8_18312', satz19f)). 0.19/0.58 thf(c_0_14, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])). 0.19/0.58 thf(c_0_15, plain, ((imp)=(^[Z0/* 19 */:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])). 0.19/0.58 thf(c_0_16, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])). 0.19/0.58 thf(c_0_17, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(fof_simplification,[status(thm)],[def_l_or])). 0.19/0.58 thf(c_0_18, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_14, c_0_15])). 0.19/0.58 thf(c_0_19, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])). 0.19/0.58 thf(c_0_20, plain, ((moreis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z0 @ Z1))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[def_moreis])). 0.19/0.58 thf(c_0_21, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z0 @ Z1))))), inference(apply_def,[status(thm)],[c_0_16, def_n_some])). 0.19/0.58 thf(c_0_22, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17, c_0_15]), c_0_18])). 0.19/0.58 thf(c_0_23, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_19])). 0.19/0.58 thf(c_0_24, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])). 0.19/0.58 thf(c_0_25, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])). 0.19/0.58 thf(c_0_26, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z1 @ Z0))))), inference(fof_simplification,[status(thm)],[def_iii])). 0.19/0.58 thf(c_0_27, plain, ((moreis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z0 @ Z1))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_21]), c_0_22]), c_0_23])). 0.19/0.58 thf(c_0_28, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_24, c_0_25])). 0.19/0.58 thf(c_0_29, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z1 @ Z0))))), inference(apply_def,[status(thm)],[c_0_26, def_n_some])). 0.19/0.58 thf(c_0_30, negated_conjecture, ~(![X383:$i]:(((in @ X383 @ nat)=>![X382:$i]:(((in @ X382 @ nat)=>![X381:$i]:(((in @ X381 @ nat)=>![X380:$i]:(((in @ X380 @ nat)=>((~(l_some @ nat @ (diffprop @ X383 @ X382))=>((X383)=(X382)))=>((l_some @ nat @ (diffprop @ X381 @ X380))=>(l_some @ nat @ (diffprop @ (n_pl @ X383 @ X381) @ (n_pl @ X382 @ X380)))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz22a])]), c_0_27]), c_0_21]), c_0_28])])). 0.19/0.58 thf(c_0_31, plain, ![X389:$i]:(((in @ X389 @ nat)=>![X388:$i]:(((in @ X388 @ nat)=>![X387:$i]:(((in @ X387 @ nat)=>![X386:$i]:(((in @ X386 @ nat)=>((l_some @ nat @ (diffprop @ X388 @ X389))=>((l_some @ nat @ (diffprop @ X386 @ X387))=>(l_some @ nat @ (diffprop @ (n_pl @ X388 @ X386) @ (n_pl @ X389 @ X387))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz21a]), c_0_29]), c_0_28])])). 0.19/0.58 thf(c_0_32, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&((in @ esk3_0 @ nat)&((in @ esk4_0 @ nat)&(((l_some @ nat @ (diffprop @ esk1_0 @ esk2_0))|((esk1_0)=(esk2_0)))&((l_some @ nat @ (diffprop @ esk3_0 @ esk4_0))&~(l_some @ nat @ (diffprop @ (n_pl @ esk1_0 @ esk3_0) @ (n_pl @ esk2_0 @ esk4_0))))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])). 0.19/0.58 thf(c_0_33, plain, ![X573:$i, X574:$i, X575:$i, X576:$i]:((~(in @ X573 @ nat)|(~(in @ X574 @ nat)|(~(in @ X575 @ nat)|(~(in @ X576 @ nat)|(~(l_some @ nat @ (diffprop @ X574 @ X573))|(~(l_some @ nat @ (diffprop @ X576 @ X575))|(l_some @ nat @ (diffprop @ (n_pl @ X574 @ X576) @ (n_pl @ X573 @ X575)))))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])). 0.19/0.58 thf(c_0_34, negated_conjecture, ~((l_some @ nat @ (diffprop @ (n_pl @ esk1_0 @ esk3_0) @ (n_pl @ esk2_0 @ esk4_0)))), inference(split_conjunct,[status(thm)],[c_0_32])). 0.19/0.58 thf(c_0_35, plain, ![X1:$i, X4:$i, X6:$i, X5:$i]:(((l_some @ nat @ (diffprop @ (n_pl @ X4 @ X6) @ (n_pl @ X1 @ X5)))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((in @ X5 @ nat))|~((in @ X6 @ nat))|~((l_some @ nat @ (diffprop @ X4 @ X1)))|~((l_some @ nat @ (diffprop @ X6 @ X5))))), inference(split_conjunct,[status(thm)],[c_0_33])). 0.19/0.58 thf(c_0_36, negated_conjecture, (l_some @ nat @ (diffprop @ esk3_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_32])). 0.19/0.58 thf(c_0_37, negated_conjecture, (in @ esk3_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_32])). 0.19/0.58 thf(c_0_38, negated_conjecture, (in @ esk4_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_32])). 0.19/0.58 thf(c_0_39, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_32])). 0.19/0.58 thf(c_0_40, negated_conjecture, (in @ esk2_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_32])). 0.19/0.58 thf(c_0_41, negated_conjecture, ((l_some @ nat @ (diffprop @ esk1_0 @ esk2_0))|((esk1_0)=(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_32])). 0.19/0.58 thf(c_0_42, negated_conjecture, ~((l_some @ nat @ (diffprop @ esk1_0 @ esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36]), c_0_37]), c_0_38]), c_0_39]), c_0_40])])). 0.19/0.58 thf(c_0_43, plain, ![X412:$i]:(((in @ X412 @ nat)=>![X411:$i]:(((in @ X411 @ nat)=>![X410:$i]:(((in @ X410 @ nat)=>((l_some @ nat @ (diffprop @ X411 @ X412))=>(l_some @ nat @ (diffprop @ (n_pl @ X410 @ X411) @ (n_pl @ X410 @ X412)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz19f]), c_0_29]), c_0_28])])). 0.19/0.58 thf(c_0_44, negated_conjecture, ((esk2_0)=(esk1_0)), inference(sr,[status(thm)],[c_0_41, c_0_42])). 0.19/0.58 thf(c_0_45, plain, ![X597:$i, X598:$i, X599:$i]:((~(in @ X597 @ nat)|(~(in @ X598 @ nat)|(~(in @ X599 @ nat)|(~(l_some @ nat @ (diffprop @ X598 @ X597))|(l_some @ nat @ (diffprop @ (n_pl @ X599 @ X598) @ (n_pl @ X599 @ X597)))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])])). 0.19/0.58 thf(c_0_46, negated_conjecture, ~((l_some @ nat @ (diffprop @ (n_pl @ esk1_0 @ esk3_0) @ (n_pl @ esk1_0 @ esk4_0)))), inference(spm,[status(thm)],[c_0_34, c_0_44])). 0.19/0.58 thf(c_0_47, plain, ![X5:$i, X4:$i, X1:$i]:(((l_some @ nat @ (diffprop @ (n_pl @ X5 @ X4) @ (n_pl @ X5 @ X1)))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((in @ X5 @ nat))|~((l_some @ nat @ (diffprop @ X4 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_45])). 0.19/0.58 thf(c_0_48, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46, c_0_47]), c_0_36]), c_0_39]), c_0_37]), c_0_38])]), ['proof']). 0.19/0.58 # SZS output end CNFRefutation 0.19/0.58 # Parsed axioms : 391 0.19/0.58 # Removed by relevancy pruning/SinE : 263 0.19/0.58 # Initial clauses : 223 0.19/0.58 # Removed in clause preprocessing : 58 0.19/0.58 # Initial clauses in saturation : 165 0.19/0.58 # Processed clauses : 354 0.19/0.58 # ...of these trivial : 5 0.19/0.58 # ...subsumed : 83 0.19/0.58 # ...remaining for further processing : 266 0.19/0.58 # Other redundant clauses eliminated : 20 0.19/0.58 # Clauses deleted for lack of memory : 0 0.19/0.58 # Backward-subsumed : 0 0.19/0.58 # Backward-rewritten : 5 0.19/0.58 # Generated clauses : 718 0.19/0.58 # ...of the previous two non-redundant : 690 0.19/0.58 # ...aggressively subsumed : 0 0.19/0.58 # Contextual simplify-reflections : 1 0.19/0.58 # Paramodulations : 529 0.19/0.58 # Factorizations : 2 0.19/0.58 # NegExts : 2 0.19/0.58 # Equation resolutions : 26 0.19/0.58 # Total rewrite steps : 144 0.19/0.58 # Propositional unsat checks : 0 0.19/0.58 # Propositional check models : 0 0.19/0.58 # Propositional check unsatisfiable : 0 0.19/0.58 # Propositional clauses : 0 0.19/0.58 # Propositional clauses after purity: 0 0.19/0.58 # Propositional unsat core size : 0 0.19/0.58 # Propositional preprocessing time : 0.000 0.19/0.58 # Propositional encoding time : 0.000 0.19/0.58 # Propositional solver time : 0.000 0.19/0.58 # Success case prop preproc time : 0.000 0.19/0.58 # Success case prop encoding time : 0.000 0.19/0.58 # Success case prop solver time : 0.000 0.19/0.58 # Current number of processed clauses : 137 0.19/0.58 # Positive orientable unit clauses : 20 0.19/0.58 # Positive unorientable unit clauses: 0 0.19/0.58 # Negative unit clauses : 11 0.19/0.58 # Non-unit-clauses : 106 0.19/0.58 # Current number of unprocessed clauses: 611 0.19/0.58 # ...number of literals in the above : 3172 0.19/0.58 # Current number of archived formulas : 0 0.19/0.58 # Current number of archived clauses : 117 0.19/0.58 # Clause-clause subsumption calls (NU) : 4383 0.19/0.58 # Rec. Clause-clause subsumption calls : 1068 0.19/0.58 # Non-unit clause-clause subsumptions : 80 0.19/0.58 # Unit Clause-clause subsumption calls : 96 0.19/0.58 # Rewrite failures with RHS unbound : 0 0.19/0.58 # BW rewrite match attempts : 5 0.19/0.58 # BW rewrite match successes : 1 0.19/0.58 # Condensation attempts : 0 0.19/0.58 # Condensation successes : 0 0.19/0.58 # Termbank termtop insertions : 55655 0.19/0.58 0.19/0.58 # ------------------------------------------------- 0.19/0.58 # User time : 0.069 s 0.19/0.58 # System time : 0.008 s 0.19/0.58 # Total time : 0.077 s 0.19/0.58 # Maximum resident set size: 4740 pages 0.19/0.59 0.19/0.59 # ------------------------------------------------- 0.19/0.59 # User time : 0.074 s 0.19/0.59 # System time : 0.010 s 0.19/0.59 # Total time : 0.084 s 0.19/0.59 # Maximum resident set size: 2360 pages 0.19/0.59 % E---3.1 exiting 0.32/0.59 EOF